Search results for "Complex data type"
showing 8 items of 8 documents
Metamodelling architectures for complex data integration in systems biology
2010
Systems biology aims at deciphering the functioning of biological systems on the basis of the knowledge of their molecular components and the relations between such components. To address the issues involved, high-throughput technologies are used. Taking advantage of the standards that are being currently developed to achieve consensual representations of technological domains, we present a metamodelling architecture based on these standards. The proposed architecture organises standard-specific metamodels and models into a single hierarchy. Each metamodel describes a consensus that is shared by several models of applications. A metamodel construct for description of faceted element is prop…
Voxel-based General Voronoi Diagram for Complex Data with Application on Motion Planning
2020
One major challenge in Assembly Sequence Planning (ASP) for complex real-world CAD-scenarios is to find appropriate disassembly paths for all assembled parts. Such a path places demands on its length and clearance. In the past, it became apparent that planning the disassembly path based on the (approximate) General Voronoi Diagram (GVD) is a good approach to achieve these requirements. But for complex real-world data, every known solution for computing the GVD is either too slow or very memory consuming, even if only approximating the GVD.We present a new approach for computing the approximate GVD and demonstrate its practicability using a representative vehicle data set. We can calculate a…
Incremental Generalized Discriminative Common Vectors for Image Classification.
2015
Subspace-based methods have become popular due to their ability to appropriately represent complex data in such a way that both dimensionality is reduced and discriminativeness is enhanced. Several recent works have concentrated on the discriminative common vector (DCV) method and other closely related algorithms also based on the concept of null space. In this paper, we present a generalized incremental formulation of the DCV methods, which allows the update of a given model by considering the addition of new examples even from unseen classes. Having efficient incremental formulations of well-behaved batch algorithms allows us to conveniently adapt previously trained classifiers without th…
A Reconfigurable Immersive Workbench and Wall-System for Designing and Training in 3D Environments
2007
Virtual and Augmented Reality have been widely used in many scientific fields for the last two decades in order to visualize complex data and information. Although both techniques are oriented to show users complex 3D environments by means of an intuitive and easy mechanism, they use to become useless to manipulate the information in an intuitive and realistic way. In this paper, we present SOROLLA, a new concept of workbench designed for virtual and augmented reality purposes and specially oriented to the fields of teleeducation and engineering. Unlike other proposals, SOROLLA not only allows an easy utilization and configuration, but also shows a cost-effective immersive visualization sys…
Data-Centric and Multimedia Components
2011
The content of XML documents is often primarily plain text, interspersed with various headers and perhaps some lists and tables. However, there are many applications for which the content of documents is not primarily narrative in nature, but instead includes (portions of) data records that are subject to storage and computational manipulation. The latter documents are sometimes referred to as data-centric or record-like, and they rely extensively on precise descriptions of the forms of data that can appear. In this chapter we first introduce the data type definition capabilities in XML Schema. We then consider the types of data very common in traditional databases: numeric data, dates, and…
Approximated overlap error for the evaluation of feature descriptors on 3D scenes
2013
This paper presents a new framework to evaluate feature descriptors on 3D datasets. The proposed method employs the approximated overlap error in order to conform with the reference planar evaluation case of the Oxford dataset based on the overlap error. The method takes into account not only the keypoint centre but also the feature shape and it does not require complex data setups, depth maps or an accurate camera calibration. Only a ground-truth fundamental matrix should be computed, so that the dataset can be freely extended by adding further images. The proposed approach is robust to false positives occurring in the evaluation process, which do not introduce any relevant changes in the …
On the Online Classification of Data Streams Using Weak Estimators
2016
In this paper, we propose a novel online classifier for complex data streams which are generated from non-stationary stochastic properties. Instead of using a single training model and counters to keep important data statistics, the introduced online classifier scheme provides a real-time self-adjusting learning model. The learning model utilizes the multiplication-based update algorithm of the Stochastic Learning Weak Estimator (SLWE) at each time instant as a new labeled instance arrives. In this way, the data statistics are updated every time a new element is inserted, without requiring that we have to rebuild its model when changes occur in the data distributions. Finally, and most impo…
A tool for filtering information in complex systems
2005
We introduce a technique to filter out complex data-sets by extracting a subgraph of representative links. Such a filtering can be tuned up to any desired level by controlling the genus of the resulting graph. We show that this technique is especially suitable for correlation based graphs giving filtered graphs which preserve the hierarchical organization of the minimum spanning tree but containing a larger amount of information in their internal structure. In particular in the case of planar filtered graphs (genus equal to 0) triangular loops and 4 element cliques are formed. The application of this filtering procedure to 100 stocks in the USA equity markets shows that such loops and cliqu…